An Ancient Automaton

An automaton group: a computational case study

We introduce a two generated weakly branch contracting automaton group $G$ which is generated by a two state automaton on a three letter alphabet. Using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. Furthermore some algebraic properties of $G$ are detected .

An Experimental Mobile Automaton

an automaton group: a computational case study

we introduce a two generated weakly branch contracting automaton group $g$ which is generated by a two state automaton on a three letter alphabet. using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. furthermore some algebraic properties of $g$ are detected .

Ancient Gold Mining Activities in India - An Overview

Gold was obtained through washing or panning of the river sands during initial periods of civilisation. With the advent of knowledge of metallurgical processing of ores it was recovered through mining of in-situ quartz reefs, and then from auriferous sulphide ores. The metal mining activities are evidenced in the form of large number of ‘ancient metal mines’ or ‘old workings’ and ‘placer mining...

Identifying an automaton model for timed data

A model for discrete event systems (DES) can be learned from observations. We propose a simple type of timed automaton to model DES where the timing of the events is important. Learning such an automaton is proven to be NP-complete by a reduction from the problem of learning deterministic finite state automata (DFA) without time. Based on this reduction, we show how the currently best learning ...